Secret sharing system, secret sharing apparatus, secret sharing method, secret sorting method, secret sharing program

ABSTRACT

A secret sharing system according to the present invention includes N secret sharing apparatuses. The secret sharing system according to the present invention includes fragment replacement means and reshare means. The fragment replacement means selects a number, smaller than N, of secret sharing apparatuses, generates a bijection π of {1, . . . , K}→{1, . . . , K}among the selected secret sharing apparatuses and designates a fragment a π(k)i  recorded in a selected secret sharing apparatus as a k-th fragment (i represents an identification number that indicates a selected secret sharing apparatus). The reshare means performs reshare of fragments of a numeric value used as replacements by the fragment replacement means to determine new fragments.

TECHNICAL FIELD

The present invention generally relates to an encryption application. In particular, it relates to a secret sharing system, a secret sharing apparatus, a secret sharing method, a secret sorting method and a secret sharing program for performing a functional calculation without disclosing input data.

BACKGROUND ART

As a method of yielding a particular calculation result without reconstructing an encrypted numeric value, there is a method referred to as secure computation (such as the method described in Non-patent literature 1). According to the method described in Non-patent literature 1, fragments of a numerical value are distributed among three secure computation apparatuses, which can hold the results of calculations such as addition, subtraction, constant sum, multiplication, constant multiplication, logical operations (NOT, AND, OR and exclusive-OR) and data format conversion (integer-to-binary) without reconstructing the original numeric value.

PRIOR ART LITERATURE Non-Patent Literature

-   Non-patent literature 1: Koji Chida, Dai Ikarashi, Katsumi     Takahashi, “Efficient 3-Party Secure Function Evaluation and Its     Application”, 48-th IPSJ SIG Technical Report, CSEC, pp. 1-7, Mar.     4, 2010.

SUMMARY OF THE INVENTION Problems to be Solved by the Invention

However, the conventional technique has a problem that a plurality of pieces of data cannot be randomly replaced while concealing the association of the pieces of data. An object of the present invention is to provide a secure computation technique of outputting data that cannot be associated with a plurality of pieces of input data.

Means to Solve the Problems

The present invention relates to a secret sharing. In general, in a (k, n) secret sharing, a secret sharing system has two parameters k and n and divides a value to be concealed into n fragments in such a manner that gathering less than k of the n fragments does not lead to leakage of information concerning the original value but gathering k or more of the n fragments permits reconstruction of the original value. A secret sharing system according to the present invention comprises N secret sharing apparatuses R₁, . . . , and R_(N). It is assumed that N represents an integer equal to or greater than 3, n represents an integer equal to or greater than 1 and equal to or smaller than N, M represents an integer equal to or greater than 1, m represents an integer equal to or greater than 1 and equal to or smaller than M, K represents an integer equal to or greater than 2, k represents an integer equal to or greater than 1 and equal to or smaller than K, numeric values A₁ ⁽¹⁾, . . . , A_(K) ⁽¹⁾, . . . , A₁ ^((M)), . . . , and A_(K) ^((M)) are K×M numeric values whose fragments are recorded in the secret sharing apparatuses in a distributed manner, numeric values A_(K) ⁽¹⁾, . . . , and A_(K) ^((M)) are a group of k-th numeric values associated with each other, and a_(kn) ^((m)) is a fragment of the numeric value A_(k) ^((m)) recorded in an n-th secret sharing apparatus. The secret sharing system according to the present invention comprises selection means, fragment replacement means and reshare means. The selection means selects a number, equal to or greater than 2 and smaller than N, of secret sharing apparatuses. The fragment replacement means generates a bijection π of {1, . . . , K}→{1, . . . , K} among the selected secret sharing apparatuses and designates fragments a_(π(k)i) ⁽¹⁾, . . . , and a_(π(k)i) ^((M)) of a group of π(k)-th numeric values associated with each other recorded in a selected secret sharing apparatus R_(i) (i represents an identification number that indicates a selected secret sharing apparatus) as fragments of a group of k-th numeric values associated with each other. The reshare means performs reshare of the fragments a_(π(k)i) ⁽¹⁾, . . . , and a_(π(k)i) ^((M)) of numeric values A_(π(k)) ⁽¹⁾, . . . , and A_(π(k)) ^((M)) that are used as replacements by said fragment replacement means to determine new fragments b_(k1) ⁽¹⁾, . . . , b_(kN) ⁽¹⁾, . . . , b_(k1) ^((M)), . . . , and b_(kN) ^((M)) (this process will be referred to as a reshare, hereinafter). In the case where reshare of a group of numeric values is performed while maintaining the association of the numeric values associated with each other, the same bijection π can be used to replace the fragments of the numeric values of the group of numeric values associated with each other.

The secret sharing system according to the present invention can further comprise initial information distribution means, initial multiplication means, checking distribution means, checking multiplication means and tamper detection means. The initial information distribution means determines fragments p_(1n), . . . , and p_(Kn) of each of K numeric values P₁, . . . , and P_(K) that are not known to any of the secret sharing apparatuses R₁, . . . , and R_(N) by a secure computation and records the fragments p_(1n), . . . , and p_(Kn) in a secret sharing apparatus R_(n). The initial multiplication means determines fragments s_(k1), . . . , and s_(kN) of a numeric value S_(k) that satisfies a relation that S_(k)=P_(k)×A_(k) ⁽¹⁾ for the secret sharing apparatuses R₁, . . . , and R_(N) by a secure computation and records the fragments s_(k1), . . . , and s_(kN) in the secret sharing apparatuses R₁, . . . , and R_(N) in a distributed manner. The checking distribution means generates fragments q_(k1), . . . , and q_(kN) of a numeric value Q_(k) that satisfies a relation that Q_(k)=P_(π(k)) for k=1 to K by a secure computation and records the fragments q_(k1), . . . , and q_(kN) in the secret sharing apparatuses R₁, . . . , and R_(N) in a distributed manner. The checking multiplication means determines fragments t_(k1), . . . , and t_(kN) of a numeric value T_(k) that satisfies a relation that T_(k)=Q_(k)×B_(k) ⁽¹⁾ for the secret sharing apparatuses R₁, . . . , and R_(N) by a secure computation and records the fragments t_(k1), . . . , and t_(kN) in the secret sharing apparatuses R₁, . . . , and R_(N) in a distributed manner. The tamper detection means checks whether a relation that T_(k)=S_(π(k)) holds or not for k=1 to K.

For example, in a case where the secret sharing system comprises three secret sharing apparatuses, it is assumed that three fragments of an m-th numeric value A_(k) ^((m))=a_(kαβ) ^((m))+a_(kβγ) ^((m))+a_(γα) ^((m)) of a group of k-th numeric values associated with each other are (a_(kγα) ^((m)), a_(kαβ) ^((m))), (a_(kαβ) ^((m)), a_(kβγ) ^((m))) and (a_(kβγ) ^((m)), a_(kγα) ^((m))) (a combination (α, β, γ) is any of combinations (1, 2, 3), (2, 3, 1) and (3, 1, 2)). It is further assumed that a fragment recorded in a secret sharing apparatus selected as a first secret sharing apparatus is a_(k1) ^((m))=(a_(k31) ^((m)), a_(k12) ^((m))), a fragment recorded in a secret sharing apparatus selected as a second secret sharing apparatus is a_(k2) ^((m))=(a_(k12) ^((m)), a_(k23) ^((m))), and a fragment recorded in a secret sharing apparatus selected as a third secret sharing apparatus is a_(k3) ^((m))=(a_(k23) ^((m)), a_(k31) ^((m))). Each secret sharing apparatus can comprise a fragment replacement part, a first random number generation part, a second random number generation part, a first calculation part, a second calculation part, a third calculation part and a fragment update part. If the secret sharing apparatus is selected as the first secret sharing apparatus or the second secret sharing apparatus, the fragment replacement part generates a bijection π of {1, . . . , K}→{1, . . . , K} and designates fragments of the numeric values of a group of π(k)-th numeric values associated with each other as fragments of the numeric values of the group of k-th numeric values associated with each other. If the secret sharing apparatus is the first secret sharing apparatus, the first random number generation part generates random numbers b_(k31) ⁽¹⁾, . . . , and b_(k31) ^((M)) for reshare of the fragments of the numeric values of the group of k-th numeric values associated with each other resulting from the designation and transmits the random numbers b_(k31) ⁽¹⁾, . . . , and b_(k31) ^((M)) to the third secret sharing apparatus. If the secret sharing apparatus is the second secret sharing apparatus, the second random number generation part generates random numbers b_(k23) ⁽¹⁾, . . . , and b_(k23) ^((M)) for reshare of the fragments of the numeric values of the group of k-th numeric values associated with each other and transmits the random numbers b_(k23) ⁽¹⁾, . . . , and b_(k23) ^((M)) to the third secret sharing apparatus. If the secret sharing apparatus is the first secret sharing apparatus, the first calculation part calculates a value x_(k) ^((m)) according to x_(k) ^((m))=b_(k31) ^((m))−a_(π(k)31) ^((m)) for m=1 to M for reshare of the fragments of the numeric values x_(k) ⁽¹⁾, . . . , and x_(k) ^((M)) of the group of k-th numeric values associated with each other and transmits the value to the second secret sharing apparatus. If the secret sharing apparatus is the second secret sharing apparatus, the second calculation part calculates a value y_(k) ^((m)) according to y_(k) ^((m))=b_(k23) ^((m))−a_(π(k)23) ^((m)) for m=1 to M for reshare of the fragments of the numeric values of the group of k-th numeric values associated with each other and transmits the value y_(k) ⁽¹⁾, . . . , and y_(k) ^((M)) to the first secret sharing apparatus. If the secret sharing apparatus is the first or second secret sharing apparatus, the third calculation part calculates a value b_(k12) ^((m)) according to b_(k12) ^((m))=a_(π(k)12) ^((m))−x_(k) ^((m)−y) _(k) ^((m)) for m=1 to M for reshare of the fragments of the numeric values of the group of k-th numeric values associated with each other. The fragment update part designates (b_(k31) ^((m)), b_(k12) ^((m))) as a fragment b_(k1) ^((m)) if the secret sharing apparatus is the first secret sharing apparatus, designates (b_(k12) ^((m)), b_(k23) ^((m))) as a fragment b_(k2) ^((m)) if the secret sharing apparatus is the second secret sharing apparatus, and designates (b_(k23) ^((m)), b_(k31) ^((m))) as a fragment b_(k3) ^((m)) if the secret sharing apparatus is the third secret sharing apparatus. The fragment replacement parts of all the secret sharing apparatuses form the fragment replacement means of the secret sharing system. The first random number generation part, the second random number generation part, the first calculation part, the second calculation part, the third calculation part and the fragment update part form the reshare means of the secret sharing system.

Effects of the Invention

With the secret sharing system according to the present invention, any secret sharing apparatus that is not selected by the fragment replacement part does not know the bijection π and therefore cannot know the association between the numeric values A₁ ⁽¹⁾, . . . , A_(K) ⁽¹⁾, . . . , A₁ ^((M)), . . . , and A_(K) ^((M)) and the numeric values B₁ ⁽¹⁾, . . . , B_(K) ⁽¹⁾, . . . , B₁ ^((M)), . . . , and B_(K) ^((M)). According to the present invention, a sorting algorithm based on comparison, such as quick sort, can be achieved by a secure computation without increasing the number of comparisons.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagram showing an example of a functional configuration of secret sharing systems according to first and second embodiments;

FIG. 2 is a diagram showing a flow of a secret sharing process performed by the secret sharing system according to the first embodiment;

FIG. 3 is a diagram showing a flow of a process of sorting numeric values in the secret sharing systems according to the present invention;

FIG. 4 is a diagram showing a quick sort algorithm;

FIG. 5 is a diagram showing a flow of a secret sharing process performed by the secret sharing system according to the second embodiment;

FIG. 6 is a diagram showing an example of a functional configuration of secret sharing systems according to third and fourth embodiments;

FIG. 7 is a diagram showing an example of a specific configuration of reshare parts according to the third and fourth embodiments;

FIG. 8 is a diagram showing a flow of a secret sharing process performed by the secret sharing system according to the third embodiment;

FIG. 9 is a diagram showing a specific structure of a tamper detection part according to the fourth embodiment; and

FIG. 10 is a diagram showing a flow of a secret sharing process performed by the secret sharing system according to the fourth embodiment.

DETAILED DESCRIPTION OF THE EMBODIMENTS

In the following, embodiments of the present invention will be described in detail. Components having the same functions will be denoted by the same reference numerals, and redundancy of the description thereof will be avoided.

First Embodiment

In the description of MEANS TO SOLVE THE PROBLEMS, it has been assumed that numeric values A₁ ⁽¹⁾, . . . , A_(K) ⁽¹⁾, . . . , A₁ ^((M)), . . . , A_(K) ^((M)) are K×M numeric values whose fragments are to be distributed among and recorded in secret sharing apparatuses, the numeric values A_(k) ⁽¹⁾, . . . , and A_(k) ^((M)) are associated to form a k-th numeric value group, and a fragment of a numeric value A_(k) ^((m)) to be recorded in an n-th secret sharing apparatus is denoted by a_(kn) ^((m)). In the description of DETAILED DESCRIPTION OF THE EMBODIMENTS, to facilitate understanding of the present invention, a case where M=1 will be first described, and then a case where M is not limited to 1 will be described. In the description of the case where M=1, A_(k) ⁽¹⁾ is expressed as A_(k), and a_(kn) ⁽¹⁾ is expressed as a_(kn).

[Limited Shuffling]

FIG. 1 shows an example of a functional configuration of a secret sharing system according to the first embodiment. FIG. 2 shows a flow of a secret sharing process performed by the secret sharing system according to the first embodiment. The secret sharing system according to this embodiment comprises N secret sharing apparatuses 100 ₁, . . . , and 100 _(N) and selection means 105 connected to a network 1000 (N represents an integer equal to or greater than 3, and n represents an integer equal to or greater than 1 and equal to or smaller than N). A₁, . . . , and A_(K) are K numeric values whose fragments are to be distributed among and recorded in the secret sharing apparatuses 100 _(n) (K represents an integer equal to or greater than 2), a numeric value A_(k) is a k-th numeric value (k represents an integer equal to or greater than 1 and equal to or smaller than K), and a_(kn) represents a k-th fragment to be recorded in the secret sharing apparatus 100 _(n). The numeric values A₁, . . . , and A_(K) are a group of numeric values to be concealed, for example, a group of numeric values to be sorted. The group of numeric values to be sorted can be a group of numeric values A_(k) each representing the annual income of a particular person. The selection means 105 may be provided in any of the secret sharing apparatuses or provided as a separate apparatus.

The secret sharing system according to this embodiment comprises the selection means, fragment replacement means and reshare means. The secret sharing apparatus 100 _(n) comprises at least a fragment replacement part 110 _(n), a reshare part 120 _(n) and a recording part 190 _(n). The recording part 190 _(n) records fragments a_(1n), . . . , and a_(Kn), for example. The recording part 190 _(n) also records information concerning what number fragment of the numeric value A_(k) is the fragment a_(kn) recorded in itself.

The selection means 105 selects a number, smaller than N, of secret sharing apparatuses (S105). For example, if the secret sharing requires N′ of the N fragments to reconstruct the numeric value, it is enough that the fragment replacement means selects a number, equal to or greater than N′ and smaller than N, secret sharing apparatuses.

The fragment replacement means comprises at least fragment replacement parts 110 ₁, . . . , and 110 _(N). A bijection π of {1, . . . , K}→{1, . . . , K} is generated among fragment replacement parts 110 _(i) of secret sharing apparatuses 100 _(i) (i represents the identification number of the selected secret sharing apparatus) selected by the selection means 105, and a fragment a_(π(k)i) recorded in a recording part 190 _(i) of the selected secret sharing apparatus 100 _(i) is designated as the k-th fragment (S110). The bijection π may be a mapping of numbers 1 to K randomly rearranged. The bijection π is desirably a uniformly randomly rearranged mapping and can be generated by Fisher-Yates shuffle (Reference Literature 1: Richard Durstenfeld, “Algorithm 235: Random permutation”, Communications of the ACM archive, Volume 7, Issue 7, 1964), for example. The bijection π may be generated among the selected secret sharing apparatuses 100 _(i) or may be generated by one of the selected secret sharing apparatuses 100 _(i) and shared among the selected secret sharing apparatuses 100 _(i).

The reshare means comprises at least reshare parts 120 ₁, . . . , 120 _(N). The reshare means performs reshare of the fragments a_(π(k)i) (a fragment a_(π(k)i) is the k-th replaced fragment) of the numeric value A_(π(k)) that are replacements used by the fragment replacement means to determine new fragments b_(k1), . . . , and b_(kN), and assumes the fragments b_(k1), . . . , b_(kN) as fragments of a numeric value B_(k) (S120). That is, a relation that A_(π(k))=B_(k) holds. However, the secret sharing apparatuses that are not selected do not know the bijection π and therefore the relation that A_(π(k))=B(k). The recording part 190 _(n) of each secret sharing apparatus 100 _(n) records not only the fragment b_(kn) but also information that the k-th fragment b_(kn) recorded in itself is a fragment of the numeric value B_(k). Furthermore, if the numeric values B₁, . . . , and B_(K) are regarded as new numeric values A₁, . . . , and A_(K), and the combination of the secret sharing apparatuses selected by the fragment replacement means is modified, the process described above can be repeated (S111 and S112).

The secret sharing system according to the present invention shuffles the fragments among a limited number of secret sharing apparatuses. Therefore, the secret sharing apparatus that are not selected by the fragment replacement part do not know the bijection π and therefore the association between the numeric values A₁, . . . , and A_(k) and the numeric values B₁, . . . , B_(k). In other words, if one wants to conceal the association between the numeric values A₁, . . . , and A_(K) and the numeric values B₁, . . . , and B_(K) from a particular secret sharing apparatus, the secret sharing apparatuses to be selected can determined so that the fragment replacement part does not select that secret sharing apparatus. Furthermore, if the above process is repeated by modifying the combination of the secret sharing apparatuses selected by the fragment replacement part so that every secret sharing apparatus has experience of not being selected at least once, the numeric values B₁, . . . , and B_(K) that cannot be associated with the numeric values A₁, . . . , and A_(K) by all the secret sharing apparatuses can be obtained.

[Redistribution]

In the above description of limited shuffling, reshare has not been described in detail. In this section, a reshare method will be described. The reshare method involves the update method disclosed in Section 3.3 of Reference Literature 2 (Amir Herzberg, Stanislaw Jarecki, Hugo Krawczyk, and Moti Yung, “Proactive secret sharing or: How to cope with perpetual leakage”, In Don Coppersmith, editor, CRYPTO 1995, volume 963 of LNCS, pages 339-352. Springer, 1995) and the regeneration method disclosed in Section 6.1 of Reference Literature 3 (Haiyun Luo and Songwu Lu, “Ubiquitous and robust authentication services for ad hoc wireless networks”, In UCLA-CSD-TR-200030, 2000). New fragments are generated among the secure computation apparatuses selected by the selection means 105 according to the update method disclosed in Reference Literature 2, and then, new fragments for the secure computation apparatuses that are not selected by the selection means 105 are generated according to the regeneration method disclosed in Reference Literature 3.

An algorithm, which is an application of the update method disclosed in Reference Literature 2 to the present invention, will be described below. It is assumed that the selection means 105 has selected N′ secret sharing apparatuses. It is further assumed that i and j represent numbers that identify the selected secret sharing apparatuses (any of the N′ numbers selected from among 1 to N) and are not equal to each other (j≠i). It is further assumed that values z₁, . . . , and z_(N) are predetermined values and shared among all the secret sharing apparatuses.

(1) All the secret sharing apparatuses 100 _(i) generate N′−1 random numbers u_(i,1), u_(i,2), . . . , and u_(i,N′-1). (2) All the secret sharing apparatuses 100 _(i) determine Z_(i)(z): 0=+u_(i,1)z+u_(i,2)z²+ . . . +u_(i,N′-1)z^(N′-1). (3) All the secret sharing apparatuses 100 _(i) transmit the value of Z_(i)(z_(j)) to all the other selected secret sharing apparatuses 100 _(j) (there are N′−1 secret sharing apparatuses 100 _(j) that are not selected). (4) All the secret sharing apparatuses 100 _(i) denote the sum of all the values of Z_(j)(z_(i)) received from the other selected secret sharing apparatuses 100 _(j) (there are N′−1 secret sharing apparatuses 100 _(j) that are not selected) as Z(z_(i)), and determine new fragments b_(ki) using the replacement fragments a_(π(k)i) according to the following formula:

b _(ki) =a _(π(k)i) +Z(z _(i))

Next, an algorithm, which is an application of the regeneration method disclosed in Reference Literature 3 to the present invention, will be described. It is assumed that the “h” represents a number that identifies a secret sharing apparatus that is not selected (any of the N′-N numbers that are not selected from among 1 to N). It is further assumed that a relation that L_(ij)(z)=(z−z_(j))/(z_(i)−z_(j)) holds, and L_(i)(z) is the product of the values of L_(ij)(z) for all the numbers j.

(5) All the secret sharing apparatuses 100 _(i) generate random numbers v_(i,j) ^((h)) for all the combinations of the numbers j greater than i (i<j) and the secret sharing apparatuses 100 _(h) that are not selected. (6) All the secret sharing apparatuses 100 _(i) transmit the random numbers v_(i,j) ^((h)) to the secret sharing apparatuses 100 _(j). (7) For all the secret sharing apparatuses 100 _(h) that are not selected, all the secret sharing apparatuses 100 _(i) denote the sum of all the random numbers v_(i,j) ^((h)) for i and j that satisfy a relation that j<i as V^((h+)) and the sum of all the random numbers v_(i,j) ^((h)) for i and j that satisfy a relation that i<j as V^((h−)), determine a value w_(hi) according to the following formula:

w _(hi) =b _(ki) L _(i)(z _(h))+V ^((h+)) −V ^((h−))

and transmit the value w_(hi) to the secret sharing apparatuses 100 _(h). (8) All the secret sharing apparatuses 100 _(h) regard the sum of all the received values w_(hi) as their respective new fragments b_(kh).

As described above, through the steps (1) to (4), all the selected secret sharing apparatuses record new fragments. Through the steps (5) to (8), all the secret sharing apparatus that are not selected record new fragments.

If the steps (3) and (6) are performed at the same time, the process can be sped up. More specifically, the steps (1), (2) and (5) can be first performed, then the steps (3) and (6) can be performed at the same time, and then the steps (4), (7) and (8) can be performed.

[Sorting]

FIG. 3 shows a flow of a process of sorting numeric values in the secret sharing system according to the first embodiment. Through the process described above, new numeric values A₁, . . . , and A_(K) that cannot be associated with the initial numeric values A₁, . . . , and A_(K) have been obtained (S101). In the case where sorting is also to be performed, the secret sharing apparatus 100 _(n) further comprises a comparison part 210 _(n) and an exchange part 220 _(n). Comparison parts 210 ₁, . . . , and 210 _(N) select two numeric values and compare the two numeric values in terms of magnitude by a secure computation (S210).

Based on the result of comparison by the comparison parts 210 ₁, . . . , and 210 _(N), exchange parts 220 ₁, . . . and 220 _(N) exchange fragments of zero sets, one set or a plurality of sets of numeric values (S220). Then, until the sorting process is completed for all the numeric values, Steps S210 and S220 (required processings such as comparison, exchange and combination modification) are repeated (S211, S212).

The result of the comparison in Step S210 is information required for all the secret sharing apparatuses to perform the subsequent processing, and therefore all the secret sharing apparatuses know the information. However, since all the secret sharing apparatuses process the new numeric values A₁, . . . , and A_(K) that cannot be associated with the initial numeric values A₁, . . . , and A_(K) due to the processing of Step S101, the information concerning the initial numeric values A₁, . . . , and A_(K) does not leak. The comparison result is also information that is available by calculation from the output of sorting process, which is public information. Therefore, in the whole protocol according to this embodiment, disclosing the comparison result does not mean leaking more information than required.

More specifically, the quick sort algorithm shown in FIG. 4 can be applied to the operations involved in sorting (Steps S210, S220, S211 and S212). In this case also, the processing of comparing A[i] and A[j] is performed by concealing the values of A[i] and A[j], and the comparison result is public. In the case of this method, the number of comparisons is the same as in the case of the original quick sort and is O(N·logN) on average. Besides, this embodiment can be applied to a sorting algorithm comprising a processing of comparing numeric values in terms of magnitude and a processing of exchanging two elements of an array.

As described above, with the secret sharing system according to this embodiment, the sorting algorithm comprising comparison and element exchange can be achieved by secure computation without increasing the number of comparisons.

[Modification of Limited Shuffling]

Next, the case where M is not limited to 1 will be described. It is assumed that M represents an integer equal to or greater than 1, and m represents an integer equal to or greater than 1 and equal to or smaller than M. It is further assumed that A⁽¹⁾, . . . , and A^((M)) are vectors each having K elements, and A^((m))=(A₁ ^((m)), . . . , A_(K) ^((m))). It is further assumed that the elements of the vectors A⁽¹⁾, . . . , and A^((M)) are associated with each other. In other words, it is assumed that A_(k) ⁽¹⁾, . . . , and A_(k) ^((M)) are a group of k-th numeric values associated with each other. In this modification, limited shuffling of the group of numeric values is performed while maintaining the association of the group of numeric values associated with each other. It is further assumed that a_(kn) ^((m)) represents a fragment of a numeric value A_(k) ^((m)) recorded in the secret sharing apparatus 100 _(n). Note that the limited shuffling described above is the limited shuffling in the case where M=1, and the following description concerns more general limited shuffling.

The secret sharing system is configured as shown in FIG. 1, and the flow of the secret sharing process is as shown in FIG. 2. The secret sharing apparatus 100 _(n) comprises at least the fragment replacement part 110 _(n), the reshare part 120 _(n) and the recording part 190 _(n). However, the components are configured as described below and perform the processings described below.

The recording part 190, records fragments a_(1n) ⁽¹⁾, . . . , a_(Kn) ⁽¹⁾, . . . , a_(1n) ^((M)), . . . , and a_(Kn) ^((M)), for example. The recording part 190 _(n) also records information concerning what number fragment of the numeric value A_(k) is the fragment a_(kn) recorded in itself.

The selection means 105 selects a number, smaller than N, of secret sharing apparatuses (S105). For example, if the secret sharing requires N′ of the N fragments to reconstruct the numeric value, it is enough that the fragment replacement means selects a number, equal to or greater than N′ and smaller than N, secret sharing apparatuses. This processing is the same as that described above.

The fragment replacement means comprises at least fragment replacement parts 110 ₁, . . . , and 110 _(N). A bijection π of {1, . . . , K}→{1, . . . , K} is generated among fragment replacement parts 110 _(i) of secret sharing apparatuses 100 _(i) (i represents the identification number of the selected secret sharing apparatus) selected by the selection means 105, and fragments a_(π(k)i) ⁽¹⁾ . . . , and a_(π(k)i) ^((M)) recorded in the recording part 190 i of the selected secret sharing apparatus 100 _(i) is designated as fragments of the group of k-th numeric values associated with each other (S110).

The reshare means comprises at least reshare parts 120 ₁, . . . , 120 _(N). The reshare means performs reshare of the fragments a_(π(k)i) ⁽¹⁾, . . . , and a_(π(k)i) ^((M)) (fragments a_(π(k)i) ⁽¹⁾, . . . , and a_(π(k)i) ^((M)) are the k-th replaced fragments) of the group of numeric values A_(π(k)) ⁽¹⁾, . . . , and A_(π(k)) ^((M)) that are replacements used by the fragment replacement means to determine new fragments b_(k1) ⁽¹⁾, . . . , b_(kN) ⁽¹⁾, . . . , b_(k1) ^((M)), . . . , and b_(kN) ^((M)), and assumes the fragments b_(k) ⁽¹⁾, . . . , b_(kN) ⁽¹⁾, . . . , b_(k) ^((M)), . . . , and b_(kN) ^((M)) as fragments of numeric values B_(k) ⁽¹⁾, . . . , and B_(k) ^((M)) (S120). That is, a relation that A_(π(k)) ^((m))=B_(k) ^((m)) holds. However, the secret sharing apparatuses that are not selected do not know the bijection π and therefore the relation that A_(π(k)) ^((m))=B_(k) ^((m)). The recording part 190 _(n) of each secret sharing apparatus 100 _(n) records not only the fragment b_(kn) ^((m)) but also information that the k-th fragment b_(kn) ^((m)) recorded in itself is a fragment of the numeric value B_(k) ^((m)). Furthermore, if the numeric values B₁ ⁽¹⁾, . . . , B_(K) ⁽¹⁾, . . . , B₁ ^((M)), . . . , and B_(K) ^((M)) are regarded as new numeric values A₁ ⁽¹⁾, . . . , A_(K) ⁽¹⁾, . . . , A₁ ^((M)), . . . , and A_(K) ^((M)), and the combination of the secret sharing apparatuses selected by the fragment replacement means is modified, the process described above can be repeated (S111 and S112).

As described above, if the limited shuffling in which the association of the elements of the vectors is maintained is used, random replacement in the column direction can be performed by regarding each row as one element (a group of numeric values associated with each other) in secret sharing of data in the form of a table, for example.

Second Embodiment [Limited Shuffling]

A secret sharing system according to a second embodiment is configured as shown in FIG. 1. A secret sharing apparatus 100 _(n) according to this embodiment further comprises the components shown by dotted lines. FIG. 5 shows a flow of a secret sharing process performed by the secret sharing system according to the second embodiment. The secret sharing system according to this embodiment comprises N secret sharing apparatuses 100 ₁, . . . , and 100 _(N) and selection means 105 connected to a network 1000 (N represents an integer equal to or greater than 3, and n represents an integer equal to or greater than 1 and equal to or smaller than N). A₁, . . . , and A_(K) are K numeric values whose fragments are to be distributed among and recorded in the secret sharing apparatuses 100 _(n) (K represents an integer equal to or greater than 2), a numeric value A_(k) is a k-th numeric value (k represents an integer equal to or greater than 1 and equal to or smaller than K), and a_(kn) represents a k-th fragment to be recorded in the secret sharing apparatus 100 _(n).

The secret sharing system according to this embodiment comprises the selection means 105, initial information distribution means, initial multiplication means, fragment replacement means, reshare means, checking distribution means, checking multiplication means, and tamper detection means. The secret sharing apparatus 100 _(n) comprises an initial information distribution part 130 _(n), an initial multiplication part 140 _(n), a fragment replacement part 110 _(n), a reshare part 120 _(n), a checking distribution part 150 _(n), a checking multiplication part 160 _(n), a tamper detection part 170 _(n), and a recording part 190 _(n). The recording part 190 _(n) records fragments a_(1n), . . . , a_(Kn), for example. The recording part 190 _(n) also records information concerning what number fragment of the numeric value A_(k) is the fragment a_(kn) recorded in itself.

The selection means 105 is the same as that according to the first embodiment. The initial information distribution means comprises initial information distribution parts 130 ₁, . . . , and 130 _(N). The initial information distribution part 130 ₁ of the secure computation apparatus 100 _(i) selected by the selection means 105 determines fragments p₁₁, . . . , p_(K1), . . . , p_(1n), . . . , p_(Kn), . . . , p_(1N), . . . , and p_(KN) of K numeric values P₁, . . . , and P_(K) that are not known to all the secret sharing apparatuses 100 ₁, . . . , and 100 _(N), and the fragments p_(1n), . . . , and p_(Kn) are recorded in the secret sharing apparatus 100 _(n) (S130). Specifically, two or more secret sharing apparatuses are chosen from among the secret sharing apparatuses selected by the selection means 105. Then, based on the values generated by the chosen secret sharing apparatuses, fragments of the values that are not known to any apparatuses can be generated. For example, two secret sharing apparatuses 100 _(i) and 100 _(j) are chosen (i≠j), and fragments of the numeric value generated by the secret sharing apparatus 100 _(i) and fragments of the numeric value generated by the secret sharing apparatus 100 _(j) are recorded in a distributed manner. Then, the sum of the two numeric values is determined by a secure computation, and the fragments are recorded in a distributed manner so that the result of the secure computation is concealed. Then, the fragments of the numeric values that are not known to all the secret sharing apparatuses can be recorded in a distributed manner. Although two secure computation apparatuses are chosen in this example, more than two secure computation apparatuses can also be chosen.

The initial multiplication means comprises initial multiplication parts 140 ₁, . . . , and 140 _(N). The initial multiplication parts 140 _(i), . . . , and 140 _(N) determine fragments s_(k1), . . . , and s_(kN) of a numeric value S_(k) that satisfies a relation that S_(k)=P_(k)×A_(k), and the fragments are distributed among and recorded in the secret sharing apparatuses 100 ₁, . . . , and 100 _(N).

The fragment replacement means and the reshare means are the same as those according to the first embodiment. The checking distribution means comprises checking distribution parts 150 ₁, . . . , and 150 _(N). The checking distribution parts 150 ₁, . . . , and 150 _(N) generate fragments q_(k1), . . . , and q_(kN) of a numeric value Q_(k) that satisfies a relation that Q_(k)=P_(α(k)) for k=1 to K by a secure computation, and the fragments are distributed among and recorded in the secret sharing apparatuses 100 ₁, . . . , and 100 _(N) (S150). Specifically, based on the values generated by the chosen secret sharing apparatuses in Step S130, other fragments of the values that are not known to any apparatuses can be generated. For example, other fragments (new fragments) of the numeric value generated for the numeric value P_(π(k)) by the chosen secret sharing apparatus 100 _(i) in Step S130 and other fragments (new fragments) of the numeric value generated for the numeric value P_(π(k)) by the chosen secret sharing apparatus 100 _(j) in Step S130 are recorded in a distributed manner. Then, the sum of the two numeric values is determined by a secure computation, and the fragments are recorded in a distributed manner so that the result of the secure computation is concealed. Then, fragments of the numeric value Q_(k) that satisfies a relation that Q_(k)=P_(π(k)) and is not known to all the secret sharing apparatuses can be recorded in a distributed manner. Although two secure computation apparatuses are chosen in this example, more than two secure computation apparatuses can also be chosen as in Step S130.

The checking multiplication means comprises checking multiplication parts 160 ₁, . . . , and 160 _(N). The checking multiplication parts 160 ₁, . . . , and 160 _(N) determine fragments t_(k1), . . . , and t_(kN) of a numeric value T_(k) that satisfies a relation that T_(k)=Q_(k)×B_(k) by a secure computation, and the fragments t_(k1), . . . , and t_(kN) are distributed among and recorded in the secret sharing apparatuses 100 ₁, . . . , and 100 _(N) (S160).

The tamper detection means comprises tamper detection parts 170 ₁, . . . , and 170 _(N). The tamper detection parts 170 ₁, . . . , and 170 _(N) checks whether a relation that T_(k)=S_(π(k)) holds for k=1 to K (S170). If t_(kn)≠s_(π(k)n), it is determined that there a tamper has occurred, and abnormal termination occurs. If the numeric values B₁, . . . , and B_(K) are regarded as new numeric values A₁, . . . , and A_(K), and the combination of the secret sharing apparatuses selected by the fragment replacement means is modified, the process described above can be repeated (S111, S112).

The secret sharing system according to the second embodiment has the same effects as the secret sharing apparatus according to the first embodiment and can check whether an illegal operation to transmit a tampered value to other secret sharing apparatuses has occurred in the course of a process of concealing the association between the numeric values A₁, . . . , and A_(K) and the numeric values B₁, . . . , and B_(K). In the case where sorting is also to be performed, the secret sharing apparatus 100 _(n) further comprises a comparison part 210 _(n) and an exchange part 220 _(n). The specific sorting process is the same as that according to the first embodiment.

Third Embodiment

In the first and second embodiments, it has been assumed that the number of the secret sharing apparatuses is N (N represents an integer equal to or greater than 3). However, in a third embodiment, the number of the secret sharing apparatuses that form the secret sharing system is limited to 3 for more specific description.

[Limited Shuffling]

FIG. 6 shows an example of a functional configuration of a secret sharing system according to the third embodiment. FIG. 7 shows an example of a specific configuration of a reshare part according to the third embodiment. FIG. 8 shows a flow of a secret sharing process performed by the secret sharing system according to the third embodiment. The secret sharing system according to this embodiment comprises 3 secret sharing apparatuses 100 _(α), 100 _(β), and 100 _(γ) and selection means 105. It is assumed that a numeric value A_(k) that satisfies a relation A_(k)=a_(kαβ)+a_(kβγ)+a_(kγα) is a k-th numeric value of K numeric values (K represents an integer equal to or greater than 2, k represents an integer equal to or greater than 1 and equal to or smaller than K, and (α, β, γ) is any of (1, 2, 3), (2, 3, 1) and (3, 1, 2)), and the three fragments of the numeric value is denoted as (a_(kγα), a_(αβ)), (a_(kαβ), a_(kβγ)), and (a_(kβγ), a_(kγα)). The selection means 105 may be provided in any of the secret sharing apparatuses or provided as a separate apparatus.

The secret sharing system according to this embodiment comprises the selection means 105, fragment replacement means and reshare means. Each secret sharing apparatus 100 _(n) comprises a fragment replacement part 110 _(n), a reshare part 120 _(n) and a recording part 190 _(n) (n represents any of α, β and γ). The recording part 190 _(n) records fragments of numeric values A₁, . . . , and A_(K), for example.

The selection means 105 selects two secret sharing apparatuses. And one of the secret sharing apparatuses selected by the selection means 105 is designated as a first secret sharing apparatus 100 ₁, the other is designated as a second secret sharing apparatus 100 ₂, and the secret sharing apparatus that is not selected is designated as a third secret sharing apparatus 100 ₃ (S105). The k-th fragment recorded in the first secret sharing apparatus 100 ₁ is denoted as a_(k1)=(a_(k31), a_(k12)), the k-th fragment recorded in the second secret sharing apparatus 100 ₂ is denoted as a_(k2)=(a_(k12), a_(k23)), and the k-th fragment recorded in the third secret sharing apparatus 100 ₃ is denoted as a_(k3)=(a_(k23), a_(k31)).

The fragment replacement means comprises at least fragment replacement parts 110 _(α), 100 _(β) and 100 _(γ). The fragment replacement means generates a bijection π of {1, . . . , K}→{1, . . . , K} in the first secret sharing apparatus 100 ₁ or the second secret sharing apparatus 100 ₂, designates a fragment a_(π(k)1) recorded in the first secret sharing apparatus 100 ₁ as the k-th fragment, and designates a fragment a_(π(k)2) recorded in the second secret sharing apparatus 100 ₂ as the k-th fragment (S110). As described above in the first embodiment, the bijection π may be a mapping of numbers 1 to K randomly rearranged. The bijection π is desirably a uniformly randomly rearranged mapping and can be generated by Fisher-Yates shuffle, for example.

The reshare means comprises at least reshare parts 120 _(α), 120 _(β) and 120 _(γ). As shown in FIG. 7, the reshare part 120 _(n) comprises a first random number generation part 121 _(n), a second random number generation part 122 _(n), a first calculation part 123 _(n), a second calculation part 124 _(n), a third calculation part 125 _(n) and a fragment update part 126 _(n).

A first random number generation part 121 ₁ of the first secret sharing apparatus 100 ₁ generates a random value b_(k31) for reshare of the k-th fragment and transmits the value to the third secret sharing apparatus 100 ₃ (S121). A second random number generation part 122 ₂ of the second secret sharing apparatus 100 ₂ generates a random value b_(k23) for reshare of the k-th fragment and transmits the value to the third secret sharing apparatus 100 ₃ (S122). A first calculation part 123 ₁ of the first secret sharing apparatus 100 ₁ calculates a value x_(k) according to x_(k)=b_(k31)−a_(π(k)31) for reshare of the k-th fragment and transmits the value x_(k) to the second secret sharing apparatus 100 ₂ (S123).

A second calculation part 124 ₂ of the second secret sharing apparatus 100 ₂ calculates a value y_(k) according to y_(k)=b_(k23)−a_(π(k)23) for reshare of the k-th fragment and transmits the value y_(k) to the first secret sharing apparatus 100 ₁ (S124). A third calculation part 125 ₁ of the first secret sharing apparatus 100 ₁ and a third calculation part 125 ₂ of the second secret sharing apparatus 100 ₂ each calculate a value b_(k12) according to b_(k12)=a_(π(k)12)−x_(k)−y_(k) for reshare of the k-th fragment (S125). A fragment update part 126 ₁ of the first secret sharing apparatus 100 ₁ designates (b_(k31), b_(k12)) as a fragment b_(k1), a fragment update part 126 ₂ of the second secret sharing apparatus 100 ₂ designates (b_(k12), b_(k23)) as a fragment b_(k2), and a fragment update part 126 ₃ of the third secret sharing apparatus 100 ₃ designates (b_(k23), b_(k31)) as a fragment b_(k3) (S126). The recording part 190 _(n) of each secret sharing apparatus 100 _(n) records not only the fragment b_(kn) but also information that the k-th fragment b_(kn) recorded in itself is a fragment of the numeric value B_(k). As in the first embodiment, the fragments b_(k1), b_(k2) and b_(k3) are fragments of the numeric value B_(k). That is, Steps S121 to S125 correspond to Step S120.

Furthermore, if the numeric values B₁, . . . , and B_(K) are regarded as new numeric values A₁, . . . , and A_(K), and the combination of the secret sharing apparatuses selected by the fragment replacement means is modified, the process described above can be repeated (S111 and S112). Furthermore, if the above process is repeated by modifying the combination of the secret sharing apparatuses selected by the fragment replacement part so that every secret sharing apparatus has experience of not being selected at least once, the numeric values B₁, . . . , and B_(K) that cannot be associated with the numeric values A₁, . . . , and A_(K) by all the secret sharing apparatuses can be obtained. In this embodiment, every secret sharing apparatus can have experience of not being selected at least once if the combinations of the secret sharing apparatuses selected by the fragment replacement means are {100 _(α), 100 _(β)}, {100 _(β), 100 _(γ)} and {100 _(γ), 100 _(α)}.

Thus, the secret sharing system according to the third embodiment has the same effects as the secret sharing system according to the first embodiment. In the case where sorting is also to be performed, the secret sharing apparatus 100 _(n) further comprises a comparison part 210 _(n) and an exchange part 220 _(n). The specific sorting process is the same as that according to the first embodiment.

[Modification of Limited Shuffling]

It is assumed that M represents an integer equal to or greater than 1, and m represents an integer equal to or greater than 1 and equal to or smaller than M. It is further assumed that A⁽¹⁾, . . . , and A^((M)) are vectors each having K elements, and A^((m))=(A₁ ^((m)), . . . , A_(K) ^((m))). It is further assumed that the elements of the vectors A⁽¹⁾, . . . , and A^((M)) are associated with each other. In other words, A_(k) ⁽¹⁾, . . . , and A_(k) ^((M)) are a group of k-th numeric values associated with each other. In this modification, limited shuffling of the group of numeric values is performed while maintaining the association of the numeric values associated with each other. It is further assumed that A_(k) ^((m))=a_(kαβ) ^((m))+a_(kβγ) ^((m))+a_(kγα) ^((m)) (k represents an integer equal to or greater than 1 and equal to or smaller than K, m represents an integer equal to or greater than 1 and equal to or smaller than M, and (α, β, γ) is any of (1, 2, 3), (2, 3, 1) and (3, 1, 2)), and three fragments are denoted as (a_(kγα) ^((m)), a_(kαβ) ^((m))), (a_(kαβ) ^((m)), a_(kβγ) ^((m)), and (a_(kβγ) ^((m)), a_(kγα) ^((m))). Note that the limited shuffling described above is the limited shuffling in the case where M=1, and the following description concerns more general limited shuffling.

An example of a functional configuration of the secret sharing system is the same as that shown in FIG. 6, an example of a specific configuration of the reshare part is the same as that shown in FIG. 7, and a flow of the secret sharing process is the same as that shown in FIG. 8. The secret sharing system comprises the selection means 105, the fragment replacement means and the reshare means. The secret sharing apparatus 100 _(n) comprises at least the fragment replacement part 110 _(n), the reshare part 120 _(n) and the recording part 190 _(n) (n represents any of α, β and γ). However, the components are configured as described below and perform the processings described below.

The recording part 190, records fragments a_(1n) ⁽¹⁾, . . . , a_(Kn) ⁽¹⁾, . . . , a_(1n) ^((M)), . . . , and a_(Kn) ^((M)), for example. The recording part 190 _(n) also records information concerning what number fragment of the numeric value A_(k) is the fragment a_(kn) recorded in itself.

The selection means 105 selects two secret sharing apparatuses. And one of the secret sharing apparatuses selected by the selection means 105 is designated as a first secret sharing apparatus 100 ₁, the other is designated as a second secret sharing apparatus 100 ₂, and the secret sharing apparatus that is not selected is designated as a third secret sharing apparatus 100 ₃ (S105). The fragment of the numeric value A_(k) ^((m)) recorded in the first secret sharing apparatus 100 ₁ is denoted as a_(k1) ^((m))=(a_(k31) ^((m)), a_(k12) ^((m))), the fragment of the numeric value A_(k) ^((m)) recorded in the second secret sharing apparatus 100 ₂ is denoted as a_(k2) ^((m))=(a_(k12) ^((m)), a_(k23) ^((m))), and the fragment of the numeric value A_(k) ^((m)) recorded in the third secret sharing apparatus 100 ₃ is denoted as a_(k3) ^((m))=(a_(k23) ^((m)), a_(k31) ^((m))).

The fragment replacement means comprises at least the fragment replacement parts 110 _(α), 100 _(β) and 100 _(γ). The fragment replacement means generates a bijection π of {1, . . . , K}→{1, . . . , K} in the first secret sharing apparatus 100 ₁ or the second secret sharing apparatus 100 ₂, designates fragments a_(π(k)1) ⁽¹⁾, . . . , and a_(π(k)1) ^((M)) recorded in the first secret sharing apparatus 100 ₁ as fragments of the group of the k-th numeric values associated with each other and designates fragments a_(α(k)2) ⁽¹⁾, . . . , and a_(π(k)2) ^((M)) recorded in the second secret sharing apparatus 100 ₂ as fragments of the group of the k-th numeric values associated with each other (S110).

The reshare means comprises at least reshare parts 120 _(α), 120 _(β) and 120 _(γ). As shown in FIG. 7, the reshare part 120 _(n) comprises the first random number generation part 121 _(n), the second random number generation part 122 _(n), the first calculation part 123 _(n), the second calculation part 124 _(n), the third calculation part 125 _(n) and the fragment update part 126 _(n).

The first random number generation part 121 ₁ of the first secret sharing apparatus 100 ₁ generates random values b_(k31) ⁽¹⁾, . . . , and b_(k31) ^((M)) for reshare of the fragments of the group of k-th numeric values associated with each other and transmits the values b_(k31) ⁽¹⁾, . . . , and b_(k31) ^((M)) to the third secret sharing apparatus 100 ₃ (S121). The second random number generation part 122 ₂ of the second secret sharing apparatus 100 ₂ generates random values b_(k23) ⁽¹⁾, . . . , and b_(k23) ^((M)) for reshare of the fragments of the group of k-th numeric values associated with each other and transmits the values b_(k23) ⁽¹⁾, . . . , and b_(k23) ^((M)) to the third secret sharing apparatus 100 ₃ (S122). The first calculation part 123 ₁ of the first secret sharing apparatus 100 ₁ calculates a value x_(k) ^((m)) according to x_(k) ^((m))=b_(k31) ^((m))−a_(π(k)31) ^((m)) for m=1 to M for reshare of the fragments of the group of the k-th numeric values associated with each other and transmits the values x_(k) ⁽¹⁾, . . . , and x_(k) ^((M)) to the second secret sharing apparatus 100 ₂ (S123).

The second calculation part 124 ₂ of the second secret sharing apparatus 100 ₂ calculates a value y_(k) ^((m)) according to y_(k) ^((m))=b_(k23) ^((m))−a_(π(k)23) ^((m)) for m=1 to M for reshare of the fragments of the group of the k-th numeric values associated with each other and transmits the values y_(k) ⁽¹⁾, . . . , and y_(k) ^((M)) to the first secret sharing apparatus 100 ₁ (S124). The third calculation part 125 ₁ of the first secret sharing apparatus 100 ₁ and the third calculation part 125 ₂ of the second secret sharing apparatus 100 ₂ each calculate a value b_(k12) ^((m)) according to b_(k12) ^((m))=a_(π(k)12) ^((m))−x_(k) ^((m))−y_(k) ^((m)) for m=1 to M for reshare of the fragments of the group of the k-th numeric values associated with each other (S125). The fragment update part 126 ₁ of the first secret sharing apparatus 100 ₁ designates (b_(k31) ^((m)), b_(k12) ^((m))) as a fragment b_(k1) ^((m)), the fragment update part 126 ₂ of the second secret sharing apparatus 100 ₂ designates (b_(k12) ^((m)), b_(k23) ^((m))) as a fragment b_(k2) ^((m)), and the fragment update part 126 ₃ of the third secret sharing apparatus 100 ₃ designates (b_(k23) ^((m)), b_(k31) ^((m))) as a fragment b_(k3) ^((m)) (S126). The recording part 190 _(n) of each secret sharing apparatus 100 _(n) records not only the fragment b_(kn) ^((m)) but also information that the k-th fragment b_(kn) ^((m)) recorded in itself is a fragment of the numeric value B_(k) ^((m)). As in the first embodiment, the fragments b_(k1) ^((m)), b_(k2) ^((m)), and b_(k3) ^((m)) are fragments of the numeric value B_(k) ^((m)). That is, Steps S121 to S126 correspond to Step S120.

Furthermore, if the numeric values B₁ ⁽¹⁾, . . . , B_(K) ⁽¹⁾, . . . , B₁ ^((M)), . . . , and B_(K) ^((M)) are regarded as new numeric values A₁ ⁽¹⁾, . . . , A_(K) ⁽¹⁾, . . . , A₁ ^((M)), . . . , and A_(K) ^((M)), and the combination of the secret sharing apparatuses selected by the fragment replacement means is modified, the process described above can be repeated (S111 and S112).

As described above, if the limited shuffling in which the association of the elements of the vectors is maintained is used, random replacement in the column direction can be performed by regarding each row as one element (a group of numeric values associated with each other) in secret sharing of data in the form of a table, for example.

Fourth Embodiment

In a fourth embodiment, again, the number of the secret sharing apparatuses that form the secret sharing system is limited to 3 for more specific description. In addition, the fourth embodiment described below concerns an example in which an illegal operation detection function is provided as in the second embodiment.

[Limited Shuffling]

A configuration of a secret sharing system according to the fourth embodiment is also shown in FIG. 6. A secret sharing apparatus 100 _(n) according to this embodiment additionally comprises the components shown by dotted lines. FIG. 9 shows a specific structure of a tamper detection part. FIG. 10 shows a flow of a secret sharing process performed by the secret sharing system according to the fourth embodiment. The secret sharing system according to this embodiment comprises 3 secret sharing apparatuses 100 _(α), 100 _(β), and 100 _(γ) and selection means 105 connected to a network 1000. It is assumed that a numeric value A_(k) that satisfies a relation A_(k)=a_(kαβ)+a_(kβγ)+a_(kγα) is a k-th numeric value of K numeric values (K represents an integer equal to or greater than 2, k represents an integer equal to or greater than 1 and equal to or smaller than K, and (α, β, γ) is any of (1, 2, 3), (2, 3, 1) and (3, 1, 2)), and the three fragments of the numeric value is denoted as (a_(kγα), a_(kαβ)), (a_(kαβ), a_(kβγ)), and (a_(kβγ), a_(kγα)).

The secret sharing system according to this embodiment comprises the selection means 105, initial information distribution means, initial multiplication means, fragment replacement means, reshare means, checking distribution means, checking multiplication means and tamper detection means. The secret sharing apparatus 100 _(n) comprises an initial information distribution part 130 _(n), an initial multiplication part 140 _(n), a fragment replacement part 110 _(n), a reshare part 120 _(n), a checking distribution part 150 _(n), a checking multiplication part 160 _(n), a tamper detection part 170 _(n) and a recording part 190 _(n) (n represents any of α, β and γ). The recording part 190 _(n) records fragments of numeric values A₁, . . . , and A_(K), for example.

The selection means 105 selects two secret sharing apparatuses. And one of the secret sharing apparatuses selected by the selection means 105 is designated as a first secret sharing apparatus 100 ₁, the other is designated as a second secret sharing apparatus 100 ₂, and the secret sharing apparatus that is not selected is designated as a third secret sharing apparatus 100 ₃ (S105). The k-th fragment recorded in the first secret sharing apparatus 100 ₁ is denoted as a_(k1)=(a_(k31), a_(k12)), the k-th fragment recorded in the second secret sharing apparatus 100 ₂ is denoted as a_(k2)=(a_(k12), a_(k23)), and the k-th fragment recorded in the third secret sharing apparatus 100 ₃ is denoted as a_(k3)=(a_(k23), a_(k31)).

The initial information distribution means comprises initial information distribution parts 130 _(α), 130 _(β) and 130 _(γ). The initial information distribution parts 130 _(α), 130 _(β) and 130 _(γ) determine a fragment p_(kn) of each of K numeric values P₁, . . . , and P_(K) that are not known to any of the secret sharing apparatuses 100 _(α), 100 _(β) and 100 _(γ) by a secure computation, and the fragment p_(kn) is recorded in the secret sharing apparatus 100 _(n) (S130). For example, the first secret sharing apparatus 100 ₁ generates K random values R⁽¹⁾ ₁, . . . , and R⁽¹⁾ _(K), and the second secret sharing apparatus 100 ₂ generates K random values R⁽²⁾ ₁, . . . , and R⁽²⁾ _(K). Then, fragments (r⁽¹⁾ _(k31), r⁽¹⁾ _(k12)), (r⁽¹⁾ _(k12), r⁽¹⁾ _(k23)), and (r⁽¹⁾ _(k23), r⁽¹⁾ _(k31)) of the value R⁽¹⁾ _(k) and fragments (r⁽²⁾ _(k31), r⁽²⁾ _(k12)), (r⁽²⁾ _(k12), r⁽²⁾ _(k23)), and (r⁽²⁾ _(k23), r⁽²⁾ _(k31)) of the value R⁽²⁾ _(k) are recorded in the secret sharing apparatuses 100 ₁, 100 ₂ and 100 ₃ in a secret sharing manner. Then, the secret sharing apparatuses 100 ₁, 100 ₂ and 100 ₃ determine fragments (p_(k31), p_(k12)), (p_(k12), p_(k23)), and (p_(k23), p_(k31)) of a numeric value P_(k) that satisfies a relation that P_(k)=R⁽¹⁾ _(k)+R⁽²⁾ _(k) by a secure computation, and the fragments are distributed among and recorded in the secret sharing apparatuses 100 ₁, 100 ₂ and 100 ₃. Through this process, fragments of a numeric value that is not known to all the secret sharing apparatuses 100 _(α), 100 _(β) and 100 _(γ) can be recorded in a distributed manner.

The initial multiplication means comprises initial multiplication parts 140 _(α), 140 _(β) and 140 _(γ). The initial multiplication parts 140 _(α), 140 _(β) and 140 _(γ) determine fragments (s_(kγα), s_(kαβ)), (s_(kαβ), s_(βγ)), and (s_(βγ), s_(γα)) of a numeric value S_(k) that satisfies a relation that S_(k)=P_(k)×A_(k) by a secure computation, and the fragments are distributed among and recorded in the secret sharing apparatuses 100 _(α), 100 _(β) and 100 _(γ) (S140).

The fragment replacement means and the reshare means are the same as those according to the third embodiment. The fragment replacement means and the reshare means serve to record fragments b_(k1), b_(k2), and b_(k3) in the secret sharing apparatuses 100 _(α), 100 _(β) and 100 _(γ) as fragments of a numeric value B_(k). The checking distribution means comprises checking distribution parts 150 _(α), 150 _(β) and 150 _(γ). The checking distribution parts 150 _(α), 150 _(β) and 150 _(γ) generate fragments (q_(kγα), q_(kαβ)), (q_(kαβ), q_(kβγ)), and (q_(kβγ), q_(kγα)) of a numeric value Q_(k) that satisfies a relation that Q_(k)=P_(π(k)) for k=1 to K by a secure computation, and the fragments are distributed among and recorded in the secret sharing apparatuses 100 _(α), 100 _(β) and 100 _(γ) (S150). For example, other fragments (r′⁽¹⁾ _(π(k)31), r′⁽¹⁾ _(π(k)12)), (r′⁽¹⁾ _(π(k)12), r′⁽¹⁾ _(π(k)23)), and (r′⁽¹⁾ _(π(k)23), r′⁽¹⁾ _(π(k)31)) of the numeric value R⁽¹⁾ _(π(k)) generated by the first secret sharing apparatus 100 ₁ in Step S130 and other fragments (r′⁽²⁾ _(π(k)31), r′⁽²⁾ _(π(k)12)), (r′⁽²⁾ _(π(k)12), r′⁽²⁾ _(π(k)23)), and (r′⁽²⁾ _(π(k)23), r′⁽²⁾ _(π(k)31)) of the numeric value R⁽²⁾ _(π(k)) generated by the second secret sharing apparatus 100 ₂ are recorded in a secret sharing manner Then, the secret sharing apparatuses 100 ₁, 100 ₂ and 100 ₃ generate fragments (q_(k31), q_(k12)), (q_(k12), q_(k23)), and (q_(k23), q_(k31)) of the numeric value Q_(k) that satisfies a relation that Q_(k)=R⁽¹⁾ _(π(k))+R⁽²⁾ _(π(k)) by a secure computation using the other fragments, and the fragments are recorded in the secret sharing apparatuses 100 ₁, 100 ₂ and 100 ₃ in a distributed manner. Through the process described above, fragments of a numeric value Q_(k) that satisfies a relation that Q_(k)=P_(π(k)) and is not known to all the secret sharing apparatuses 100 _(α), 100 _(β) and 100 _(γ) can be recorded in a distributed manner.

The checking multiplication means comprises checking multiplication parts 160 _(α), 160 _(β) and 160 _(γ). The checking multiplication parts 160 _(α), 160 _(β) and 160 _(γ) determine fragments (t_(kγα), t_(kαβ)), (t_(kαβ), t_(kβγ)), and (t_(kβγ), t_(kγα)) of a numeric value T_(k) that satisfies a relation that T_(k)=Q_(k)×B_(k) by a secure computation, and the fragments are recorded in the secret sharing apparatuses 100 _(α), 100 _(β) and 100 _(γ) in a distributed manner (S160).

The tamper detection means comprises tamper detection parts 170 _(α), 170 _(β) and 170 _(γ). As shown in FIG. 9, the tamper detection part 170 _(n) comprises a third random number generation part 171 _(n), a fourth random number generation part 172 _(n), a fourth calculation part 173 _(n), a fifth calculation part 174 _(n), a first check part 175 _(n), a sixth calculation part 176 _(n), a seventh calculation part 177 _(n) and a second check part 178 _(n). The tamper detection means performs a processing as described below depending on which of the first secret sharing apparatus 100 ₁, the second secret sharing apparatus 100 ₂ and the secret sharing apparatus 100 ₃ the secret sharing apparatuses 100 _(α), 100 _(β) and 100 _(γ) operate as.

A third random number generation part 171 ₁ of the first secret sharing apparatus 100 ₁ generates a random number u_(k) and transmits the random number to the second secret sharing apparatus 100 ₂ (S171). A fourth random number generation part 172 ₂ of the second secret sharing apparatus 100 ₂ generates a random number v_(k) and transmits the random number v_(k) to the first secret sharing apparatus 100 ₁ (S172). The fourth calculation part 173 ₁ of the first secret sharing apparatus 100 ₁ calculates a value d_(k) according to d_(k)=s_(π(k)12)−t_(k12)−u_(k)−v_(k) and transmits the value d_(k) to the third secret sharing apparatus 100 ₃ (S173).

A fifth calculation part 174 ₂ of the second secret sharing apparatus 100 ₂ calculates a value e_(k) according to e_(k)=s_(π(k)12)−t_(k12)−u_(k)−v_(k) and transmits the value e_(k) to the third secret sharing apparatus 100 ₃ (S174). A first check part 175 ₃ of the third secret sharing apparatus 100 ₃ checks whether a relation d_(k)=e_(k) holds and terminates the processing if the relation does not holds (S175).

A sixth calculation part 176 ₁ of the first secret sharing apparatus 100 ₁ calculates a value f_(k) according to f_(k)=s_(π(k)31)−t_(k31)+u_(k) and transmits the value f_(k) to the third secret sharing apparatus 100 ₃ (S176). A seventh calculation part 177 ₂ of the second secret sharing apparatus 100 ₂ calculates a value g_(k) according to g_(k)=s_(π(k)23)−t_(k23)+v_(k) and transmits the value g_(k) to the third secret sharing apparatus 100 ₃ (S177). A second check part 178 ₃ of the third secret sharing apparatus 100 ₃ checks whether a relation that f_(k)+g_(k)+d_(k)=0 holds and terminates the processing if the relation does not hold (S178). If the numeric values B₁, . . . , and B_(K) are regarded as new numeric values A₁, . . . , and A_(K), and the combination of the secret sharing apparatuses selected by the fragment replacement means is modified, the process described above can be repeated (S111 and S112).

The secret sharing system according to the fourth embodiment has the same effects as the secret sharing apparatus according to the third embodiment and can check whether an illegal operation to transmit a tampered value to other secret sharing apparatuses has not occurred in the course of a process of concealing the association between the numeric values A₁, . . . , and A_(K) and the numeric values B₁, . . . , and B_(K). In the case where sorting is also to be performed, the secret sharing apparatus 100 _(n) further comprises a comparison part 210 _(n) and an exchange part 220 _(n). The specific sorting process is the same as that according to the first embodiment.

[Secret Calculation]

In the above description, it has been assumed that the secure computation is not limited to a particular method, and no specific example has been shown. In the following, a specific example of a basic secure computation that can be used in each component of the secret sharing systems according to the third and fourth embodiments will be described. In the following description, it will be assumed that fragments of a numeric value A recorded in the secret sharing apparatuses 100 _(α), 100 _(β) and 100 _(γ) in a distributed manner are denoted as (a_(γα), a_(αβ)), (a_(αβ), a_(βγ)), and (a_(βγ, a) _(γα)), fragments of a numeric value B recorded in the secret sharing apparatuses 100 _(α), 100 _(β) and 100 _(γ) in a distributed manner are denoted as (b_(γα), b_(αβ)), (b_(αβ), b_(βγ)), and (b_(βγ), b_(γα)), and fragments of a numeric value C recorded in the secret sharing apparatuses 100 _(α), 100 _(β) and 100 _(γ) in a distributed manner are denoted as (c_(γα), c_(αβ)), (c_(αβ), c_(βγ)), and (c_(βγ), c_(γα)).

Secret Sharing of Numeric Value A

(1) Random numbers a_(αβ), a_(βγ) are generated. (2) A value a_(γα) is calculated according to a_(γα)=A−a_(αβ)−a_(βγ), (a_(γα), a_(αβ)), (a_(αβ), a_(βγ)), and (a_(βγ), a_(αα)) are designated as fragments of the value A, and the fragments (a_(γα), a_(αβ)), (a_(αβ), a_(βγ)), and (a_(βγ), a_(γα)) are distributed among and recorded in the secret sharing apparatuses 100 _(α), 100 _(β) and 100 _(γ).

Reconstruction of Numeric Value A

(1) The secret sharing apparatus 100 _(α) transmits the value a_(γα) to the secret sharing apparatus 100 _(β) and transmits the value a_(αβ) to the secret sharing apparatus 100 _(γ). The secret sharing apparatus 100 _(β) transmits the value a_(αβ) to the secret sharing apparatus 100 _(γ) and transmits the value a_(βγ) to the secret sharing apparatus 100 _(α). The secret sharing apparatus 100 _(γ) transmits the value a_(βγ) to the secret sharing apparatus 100 _(α) and transmits the value a_(γα) to the secret sharing apparatus 100 _(β). (2) The secret sharing apparatus 100 _(α) calculates a value a_(αβ)+a_(βγ)+a_(γα) to reconstruct the numeric value A if the value a_(βγ) received from the secret sharing apparatus 100 _(β) and the value a_(βγ) received from the secret sharing apparatus 100 _(γ) agree with each other. The secret sharing apparatus 100 _(β) calculates the value a_(αβ)+a_(βγ)+a_(γα) to reconstruct the numeric value A if the value a_(γα) received from the secret sharing apparatus 100 _(γ) and the value a_(γα) received from the secret sharing apparatus 100 _(α) agree with each other. The secret sharing apparatus 100 _(γ) calculates the value a_(αβ)+a_(βγ)+a_(γα), to reconstruct the numeric value A if the value a_(αβ) received from the secret sharing apparatus 100 _(α) and the value a_(αβ) received from the secret sharing apparatus 100 _(β) agree with each other.

Secret Calculation of C=A+B

(1) The secret sharing apparatus 100 _(α) calculates the fragment (c_(γα), c_(αβ))=(a_(γα)+b_(γα), a_(αβ)+b_(αβ)) and records the fragment (c_(γα), c_(αβ)), the secret sharing apparatus 100 _(β) calculates the fragment (c_(αβ), c_(βγ))=(a_(αβ)+b_(αβ), a_(βγ)+b_(βγ)) and records the fragment (c_(αβ, c) _(βγ)), and the secret sharing apparatus 100 _(γ) calculates the fragment (c_(βγ), c_(γα))=(a_(βγ)+b_(βγ), a_(γα)+b_(γα)) and records the fragment (c_(βγ), c_(γα)).

Secret Calculation of C=A−B

(1) The secret sharing apparatus 100 _(α) calculates the fragment (c_(γα), c_(αβ))=(a_(γα)−b_(γα), a_(αβ)−b_(αβ)) and records the fragment (c_(γα), c_(αβ)), the secret sharing apparatus 100 _(β) calculates the fragment (c_(αβ), c_(βγ))=(a_(αβ)−b_(αβ), a_(βγ)−b_(βγ)) and records the fragment (c_(αβ), c_(βγ)), and the secret sharing apparatus 100 _(γ) calculates the fragment (c_(βγ), c_(γα))=(a_(βγ)−b_(βγ), a_(γα)−b_(γα)) and records the fragment (c_(βγ), c_(γα)).

Secret Calculation of C=A+S (S Represents a Known Constant)

(1) The secret sharing apparatus 100 _(α) calculates the fragment (c_(γα), c_(αβ))=(a_(γα)+S, a_(αβ)) and records the fragment (c_(γα), c_(αβ)), and the secret sharing apparatus 100 _(γ) calculates the fragment (c_(βγ), c_(γα))=(a_(γγ), a_(γα)+S) and records the fragment (c_(βγ), c_(γα)). The secret sharing apparatus 100 _(β) does not perform any processing.

Secret Calculation of C=AS (S Represents a Known Constant)

(1) The secret sharing apparatus 100 _(α) calculates the fragment (c_(γα), x_(αβ))=(a_(γα)S, a_(αβ)S) and records the fragment (c_(γα), c_(αβ)), the secret sharing apparatus 100 _(β) calculates the fragment (c_(αβ), c_(βγ))=(a_(αβ)S, a_(βγ)S) and records the fragment (c_(αβ), c_(βγ)), and the secret sharing apparatus 100 _(γ) calculates the fragment (c_(βγ), c_(γα)=(a) _(βγS, a) _(γα)S) and records the fragment (c_(βγ), c_(γα)).

Secret Calculation of C=AB

(1) The secret sharing apparatus 100 _(α) generates random numbers r₁, r₂, and c_(γα) and calculates a value c_(αβ) according to c_(αβ)=(a_(γα)+a_(αβ))(b_(γα)+b_(αβ))−r₁−r₂−c_(γα). Then, the secret sharing apparatus 100 _(α) transmits (r₁, c_(αβ)) to the secret sharing apparatus 100 _(β) and (r₂, c_(γα)) to the secret sharing apparatus 100 _(γ). (2) The secret sharing apparatus 100 _(β) calculates a value y according to y=a_(αβ)b_(βγ)+a_(βγ)b_(αβ)+r₁ and transmits the value y to the secret sharing apparatus 100 _(γ). (3) The secret sharing apparatus 100 _(γ) calculates a value z according to z=a_(βγ)b_(γα)+a_(γα)b_(βγ)+r₂ and transmits the value z to the secret sharing apparatus 100 _(α). (4) The secret sharing apparatus 100 _(β) and the secret sharing apparatus 100 _(γ) each calculates a value c_(βγ) according to c_(βγ)=y+z+a_(βγ)b_(βγ). (5) The secret sharing apparatus 100 _(α) records the fragment (c_(γα), c_(αβ)), the secret sharing apparatus 100 _(β) records the fragment (c_(αβ), c_(βγ)), and the secret sharing apparatus 100 _(γ) records the fragment (c_(βγ), c_(γα)).

[Program, Recording Medium]

The various processings described above can be performed not only sequentially in the order described above but also in parallel with each other or individually as required or depending on the processing power of the apparatus that performs the processings. Furthermore, of course, other various modifications can be appropriately made to the processings without departing from the spirit of the present invention.

In the case where the configurations described above are implemented by a computer, the specific processings of the functions of the apparatuses are described in a program. The computer executes the program to implement the processings described above.

The program that describes the specific processings can be recorded in a computer-readable recording medium. The computer-readable recording medium may be any type of recording medium, such as a magnetic recording device, an optical disk, a magneto-optical recording medium and a semiconductor memory.

The program may be distributed by selling, transferring or lending a portable recording medium, such as a DVD and a CD-ROM, in which the program is recorded, for example. Alternatively, the program may be distributed by storing the program in a storage device in a server computer and transferring the program from the server computer to other computers via a network.

The computer that executes the program first temporarily stores, in a storage device thereof, the program recorded in a portable recording medium or transferred from a server computer, for example. Then, when performing the processings, the computer reads the program from the storage device and performs the processings according to the read program. In an alternative implementation, the computer may read the program directly from the portable recording medium and perform the processings according to the program. As a further alternative, the computer may perform the processings according to the program each time the computer receives the program transferred from the server computer. As a further alternative, the processings described above may be performed on an application service provider (ASP) basis, in which the server computer does not transmit the program to the computer, and the processings are implemented only through execution instruction and result acquisition. The programs according to the embodiments of the present invention include a quasi-program, which is information to be processed by a computer (such as data that is not a direct instruction to a computer but has a property that defines the processings performed by the computer).

Although a predetermined program is executed on a computer to implement the apparatus according to the present invention in the embodiments described above, at least part of the specific processing may be implemented by hardware. 

1: A secret sharing system comprising N secret sharing apparatuses, wherein it is assumed that N represents an integer equal to or greater than 3, n represents an integer equal to or greater than 1 and equal to or smaller than N, M represents an integer equal to or greater than 1, m represents an integer equal to or greater than 1 and equal to or smaller than M, K represents an integer equal to or greater than 2, k represents an integer equal to or greater than 1 and equal to or smaller than K, numeric values A₁ ⁽¹⁾, . . . , A_(K) ⁽¹⁾, . . . , A₁ ^((M)), . . . , and A_(K) ^((M)) are K×M numeric values whose fragments are recorded in the secret sharing apparatuses in a distributed manner, numeric values A_(K) ⁽¹⁾, . . . , and A_(K) ^((M)) are a group of k-th numeric values associated with each other, a_(kn) ^((m)) is a fragment of a numeric value A_(k) ^((m)) recorded in an n-th secret sharing apparatus, and i represents an integer equal to or greater than 1 and equal to or smaller than N that indicates secret sharing apparatuses selected from among the N secret sharing apparatuses, and the secret sharing system comprises: selection means that selects a number, equal to or greater than 2 and smaller than N, of secret sharing apparatuses; fragment replacement means that generates a bijection π of {1, . . . , K}→{1, . . . , K}among the secret sharing apparatuses selected by said selection means and designates fragments a_(π(k)i) ⁽¹⁾, . . . , and a_(π(k)i) ^((M)) of a group of π(k)-th numeric values associated with each other recorded in an i-th selected secret sharing apparatus as fragments of a group of k-th numeric values associated with each other; and reshare means that performs reshare of the fragments a_(π(k)i) ⁽¹⁾, . . . , and a_(π(k)i) ^((M)) of numeric values A_(π(k)) ⁽¹⁾, . . . , and A_(π(k)) ^((M)) that are used as replacements by said fragment replacement means to determine new fragments b_(k1) ⁽¹⁾, . . . , b_(kN) ⁽¹⁾, . . . , b_(k1) ^((M)), . . . , and b_(kN) ^((M)) and designates the fragments b_(k1) ⁽¹⁾, . . . , b_(kN) ⁽¹⁾, . . . , b_(k1) ^((M)), . . . , and b_(kN) ^((M)) as fragments of numeric values B_(k) ⁽¹⁾, . . . , and B_(k) ^((M)). 2: The secret sharing system according to claim 1, wherein M=1. 3: The secret sharing system according to claim 2, further comprising: initial information distribution means that determines a fragment of each of K numeric values P₁, . . . , and P_(K) that are not known to any of N secret sharing apparatuses by a secure computation and records fragments p_(1n), . . . , and p_(Kn) in an n-th secret sharing apparatus; initial multiplication means that determines fragments s_(k1), . . . , and s_(kN) of a numeric value S_(k) that satisfies a relation that S_(k)=P_(k)×A_(k) ⁽¹⁾ for the N secret sharing apparatuses by a secure computation and records the fragments s_(k1), . . . , and s_(kN) in the N secret sharing apparatuses in a distributed manner; checking distribution means that generates fragments q_(k1), . . . , and q_(kN) of a numeric value Q_(k) that satisfies a relation that Q_(k)=P_(π(k)) for k=1 to K by a secure computation and records the fragments q_(k1), . . . , and q_(kN) in the N secret sharing apparatuses in a distributed manner; checking multiplication means that determines fragments t_(k1), . . . , and t_(kN) of a numeric value T_(k) that satisfies a relation that T_(k)=Q_(k)×B_(k) ⁽¹⁾ for the N secret sharing apparatuses by a secure computation and records the fragments t_(k1), . . . , and t_(kN) in the N secret sharing apparatuses in a distributed manner; and tamper detection means that checks whether a relation that T_(k)=S_(π(k)) holds or not for k=1 to K. 4: The secret sharing system according to claim 1, wherein it is assumed that N=3, a combination (α, β, γ) is any of combinations (1, 2, 3), (2, 3, 1) and (3, 1, 2), three fragments of the numeric value A_(k) ^((m))=a_(kαβ) ^((m))+a_(kβγ) ^((m))+a_(kγα) ^((m)) are (a_(kγα) ^((m)), a_(kαβ) ^((m))), (a_(kαβ) ^((m)), a_(kβγ) ^((m))) and (a_(kβγ) ^((m)), a_(kγα) ^((m))), and said three fragments are recorded in three secret sharing apparatuses in a distributed manner, said selection means selects two secret sharing apparatuses, one of the selected secret sharing apparatus being designated as a first secret sharing apparatus, the other of the selected secret sharing apparatus being designated as a second secret sharing apparatus, and the secret sharing apparatus that is not selected being designated as a third secret sharing apparatus, said fragment replacement means designates a fragment of the numeric value A_(k) ^((m)) recorded in the first secret sharing apparatus as a fragment a_(k1) ^((m))=(a_(k31) ^((m)), a_(k12) ^((m))), designates a fragment of the numeric value A_(k) ^((m)) recorded in the second secret sharing apparatus as a fragment a_(k2) ^((m))=(a_(k12) ^((m)), a_(k23) ^((m))), designates a fragment of the numeric value A_(k) ^((m)) recorded in the third secret sharing apparatus as a fragment a_(k3) ^((m))=(a_(k23) ^((m)), a_(k31) ^((m))), generates the bijection π of {1, . . . , K}→{1, . . . , K} in the first secret sharing apparatus or the second secret sharing apparatus, designates fragments a_(π(k)1) ⁽¹⁾, . . . , and a_(π(k)1) ^((M)) of the group of π(k)-th numeric values associated with each other recorded in the first secret sharing apparatus as fragments of the group of k-th numeric values associated with each other, and designates fragments a_(π(k)2) ⁽¹⁾, . . . , and a_(π(k)2) ^((M)) of a group of π(k)-th numeric values associated with each other recorded in the second secret sharing apparatus as fragments of the group of k-th numeric values associated with each other, each of said secret sharing apparatuses comprises, as said reshare means, a first random number generation part that generates random numbers b_(k31) ⁽¹⁾, . . . , and b_(k31) ^((M)) for reshare of the fragments of the group of k-th numeric values associated with each other and transmits the random numbers b_(k31) ⁽¹⁾, . . . , and b_(k31) ^((M)) to the third secret sharing apparatus if the secret sharing apparatus is the first secret sharing apparatus, a second random number generation part that generates random numbers b_(k23) ⁽¹⁾, and b_(k23) ^((M)) for reshare of the fragments of the group of k-th numeric values associated with each other and transmits the random numbers b_(k23) ⁽¹⁾, . . . , and b_(k23) ^((M)) to the third secret sharing apparatus if the secret sharing apparatus is the second secret sharing apparatus, a first calculation part that calculates a value x_(k) ^((m)) according to x_(k) ^((m))=b_(k31) ^((m))−a_(π(k)31) ^((m)) for m=1 to M for reshare of the fragments of the group of k-th numeric values associated with each other and transmits the values x_(k) ⁽¹⁾, . . . , and x_(k) ^((M)) to the second secret sharing apparatus if the secret sharing apparatus is the first secret sharing apparatus, a second calculation part that calculates a value y_(k) ^((m)) according to y_(k) ^((m))=b_(k23) ^((m))−a_(π(k)23) ^((m)) for m=1 to M for reshare of the fragments of the group of k-th numeric values associated with each other and transmits the values y_(k) ⁽¹⁾, . . . , and y_(k) ^((M)) to the first secret sharing apparatus if the secret sharing apparatus is the second secret sharing apparatus, a third calculation part that calculates a value b_(k12) ^((m)) according to b_(k12) ^((m))=a_(π(k)12) ^((m))−x_(k) ^((m))−y_(k) ^((m)) for m=1 to M for reshare of the fragments of the group of k-th numeric values associated with each other if the secret sharing apparatus is the first or second secret sharing apparatus, and a fragment update part that designates (b_(k3l) ^((m)), b_(k12) ^((m))) as a fragment b_(k1) ^((m)) if the secret sharing apparatus is the first secret sharing apparatus, designates (b_(k12) ^((m)), b_(k23) ^((m))) as a fragment b_(k2) ^((m)) if the secret sharing apparatus is the second secret sharing apparatus, and designates (b_(k23) ^((m)), b_(k31) ^((m))) as a fragment b_(k3) ^((m)) if the secret sharing apparatus is the third secret sharing apparatus, and each of said secret sharing apparatuses records the fragments b_(k1) ^((m)), b_(k2) ^((m)), and b_(k3) ^((m)) as fragments of the numeric value B_(k) ^((m)). 5: The secret sharing system according to claim 4, wherein M=1. 6: The secret sharing system according to claim 5, further comprising: initial information distribution means that generates K random values R⁽¹⁾ ₁, . . . , and R⁽¹⁾ _(K) in the first secret sharing apparatus, generates K random values R⁽²⁾ ₁, . . . , and R⁽²⁾ _(K) in the second secret sharing apparatus, records fragments (r⁽¹⁾ _(k31), r⁽¹⁾ _(k12)), (r⁽¹⁾ _(k12), r⁽¹⁾ _(k23)), and (r⁽¹⁾ _(k23), r⁽¹⁾ _(k31)) of the value R⁽¹⁾ _(k) and fragments (r⁽²⁾ _(k31), r⁽²⁾ _(k12)), (r⁽²⁾ _(k12), r⁽²⁾ _(k23)), and (r⁽²⁾ _(k23), r⁽²⁾ _(k31)) of the value R⁽²⁾ _(k) in said three secret sharing apparatuses in a secret sharing manner, determines fragments (p_(k31), p_(k12)), (p_(k12), p_(k23)), and (p_(k23), p_(k31)) of a numeric value P_(k) that satisfies a relation that P_(k)=R⁽¹⁾ _(k)+R⁽²⁾ _(k) by a secure computation in said three secret sharing apparatuses, and records the fragments (p_(k31), p_(k12)), (p_(k12), p_(k23)), and (p_(k23), p_(k31)) in said three secret sharing apparatuses in a distributed manner; initial multiplication means that determines fragments (s_(k31), s_(k12)), (s_(k12), s_(k23)), and (s_(k23), s_(k31)) of a value S_(k) that satisfies a relation that S_(k)=P_(k)×A_(k) ⁽¹⁾ by a secure computation in said three secret sharing apparatuses and records the fragments (s_(k31), s_(k12)), (s_(k12), s_(k23)), and (s_(k23), s_(k31)) in said three secret sharing apparatuses in a distributed manner; checking distribution means records other fragments (r′⁽¹⁾ _(π(k)31), r′⁽¹⁾ _(π(k)12)), (r′⁽¹⁾ _(π(k)12), r′⁽¹⁾ _(π(k)23)), and (r′⁽¹⁾ _(π(k)23), r′⁽¹⁾ _(π(k)31)) of said numeric value R⁽¹⁾ _(π(k)) and other fragments (r′⁽²⁾ _(π(k)31), r′⁽²⁾ _(π(k)12)), (r′⁽²⁾ _(π(k)12), r′⁽²⁾ _(π(k)23)), and (r′⁽²⁾ _(π(k)23), r′⁽²⁾ _(π(k)31)) of said numeric value R⁽²⁾ _(π(k)) in said three secret sharing apparatuses in a distributed manner, determines fragments (q_(k31), q_(k12)), (q_(k12), q_(k23)), and (q_(k23), q_(k31)) of a numeric value Q_(k) that satisfies a relation that Q_(k)=R⁽¹⁾ _(π(k))+R⁽²⁾ _(π(k)) by a secure computation using the other fragments in said three secret sharing apparatuses, and records the fragments (q_(k31), q_(k12)), (q_(k12), q_(k23)), and (q_(k23), q_(k31)) in said three secret sharing apparatuses in a distributed manner; and checking multiplication means that determines fragments (t_(k31), t_(k12)), (t_(k12), t_(k23)), and (t_(k23), t_(k31)) of a numeric value T_(k) that satisfies a relation that T_(k)=Q_(k)×B_(k) ⁽¹⁾ by a secure computation in said three secret sharing apparatuses and records the fragments (t_(k31), t_(k12)), (t_(k12), t_(k23)), and (t_(k23), t_(k31)) in said three secret sharing apparatuses in a distributed manner, wherein fragments recorded in the first secret sharing apparatus are s_(k1)=(s_(k31), s_(k12)) and t_(k1)=(t_(k31), t_(k12)), fragments recorded in the second secret sharing apparatus are s_(k2)=(s_(k12), s_(k23)) and t_(k2)=(t_(k12), t_(k23)), and fragments recorded in the third secret sharing apparatus are s_(k3)=(s_(k23), s_(k31)) and t_(k3)=(t_(k23), t_(k31)), each secret sharing apparatus comprises a third random number generation part that generates a random number u_(k) and transmits the random number u_(k) to the second secret sharing apparatus if the secret sharing apparatus is the first secret sharing apparatus, a fourth random number generation part that generates a random number v_(k) and transmits the random number v_(k) to the first secret sharing apparatus if the secret sharing apparatus is the second secret sharing apparatus, a fourth calculation part that calculates a value d_(k) according to d_(k)=s_(π(k)12)−t_(k12)−u_(k)−v_(k) and transmits the value d_(k) to the third secret sharing apparatus if the secret sharing apparatus is the first secret sharing apparatus, a fifth calculation part that calculates a value e_(k) according to e_(k)=s_(π(k)12)−t_(k12)−u_(k)−v_(k) and transmits the value e_(k) to the third secret sharing apparatus if the secret sharing apparatus is the second secret sharing apparatus, a first check part that checks whether a relation that d_(k)=e_(k) holds or not and terminates a processing if the relation does not hold if the secret sharing apparatus is the third secret sharing apparatus, a sixth calculation part that calculates a value f_(k) according to f_(k)=s_(π(k)31)−t_(k31)+u_(k) and transmits the value f_(k) to the third secret sharing apparatus if the secret sharing apparatus is the first secret sharing apparatus, a seventh calculation part that calculates a value g_(k) according to g_(k)=s_(π(k)23)−t_(k23)+v_(k) and transmits the value g_(k) to the third secret sharing apparatus if the secret sharing apparatus is the second secret sharing apparatus, and a second check part that checks whether a relation that f_(k)+g_(k)+d_(k)=0 holds or not and terminates a processing if the relation does not hold if the secret sharing apparatus is the third secret sharing apparatus. 7: A secret sharing apparatus in a secret sharing system comprising 3 secret sharing apparatuses, wherein it is assumed that M represents an integer equal to or greater than 1, m represents an integer equal to or greater than 1 and equal or smaller than M, K represents an integer equal to or greater than 2, k represents an integer equal to or greater than 1 and equal to or smaller than K, numeric values A₁ ⁽¹⁾, . . . , A_(K) ⁽¹⁾, . . . , A₁ ^((M)), . . . , and A_(K) ^((M)) are K×M numeric values whose fragments are recorded in the secret sharing apparatuses in a distributed manner, numeric values A_(K) ⁽¹⁾, . . . , and A_(K) ^((M)) are a group of k-th numeric values associated with each other, a fragment of a numeric value A_(k) ^((m)) to be recorded is a_(k1) ^((m))=(a_(k31) ^((m)), a_(k12) ^((m))) if the secret sharing apparatus is selected as a first secret sharing apparatus, a fragment of the numeric value A_(k) ^((m)) to be recorded is a_(k2) ^((m))=(a_(k12) ^((m)), a_(k23) ^((m))) if the secret sharing apparatus is selected as a second secret sharing apparatus, and a fragment of the numeric value A_(k) ^((m)) to be recorded is a_(k3) ^((m))=(a_(k23) ^((m)), a_(k31) ^((m))) if the secret sharing apparatus is selected as a third secret sharing apparatus, the secret sharing apparatus comprises a fragment replacement part that generates a bijection π of {1, . . . , K}→{1, . . . , K} and designates a fragment of a group of π(k)-th numeric values associated with each other as a fragment of a group of k-th numeric values associated with each other if the secret sharing apparatus is selected as the first secret sharing apparatus or the second secret sharing apparatus, a first random number generation part that generates random numbers b_(k31) ⁽¹⁾, . . . , and b_(k31) ^((M)) for reshare of the fragments of the group of k-th numeric values associated with each other and transmits the random numbers b_(k31) ⁽¹⁾, . . . , and b_(k31) ^((M)) to the third secret sharing apparatus if the secret sharing apparatus is the first secret sharing apparatus, a second random number generation part that generates random numbers b_(k23) ⁽¹⁾, . . . , and b_(k23) ^((M)) for reshare of the fragments of the group of k-th numeric values associated with each other and transmits the random numbers b_(k23) ⁽¹⁾, . . . , and b_(k23) ^((M)) to the third secret sharing apparatus if the secret sharing apparatus is the second secret sharing apparatus, a first calculation part that calculates a value x_(k) ^((m)) according to x_(k) ^((m))=b_(k31) ^((m))−a_(π(k)31) ^((m)) for m=1 to M for reshare of the fragments of the group of k-th numeric values associated with each other and transmits the values x_(k) ⁽¹⁾, . . . , and x_(k) ^((M)) to the second secret sharing apparatus if the secret sharing apparatus is the first secret sharing apparatus, a second calculation part that calculates a value y_(k) ^((m)) according to y_(k) ^((m))=b_(k23) ^((m))−a_(π(k)23) ^((m)) for m=1 to M for reshare of the fragments of the group of k-th numeric values associated with each other and transmits the values y_(k) ⁽¹⁾, . . . , and y_(k) ^((M)) to the first secret sharing apparatus if the secret sharing apparatus is the second secret sharing apparatus, a third calculation part that calculates a value b_(k12) ^((m)) according to b_(k12) ^((m))=a_(π(k)12) ^((m))−x_(k) ^((m))−y_(k) ^((m)) for m=1 to M for reshare of the fragments of the group of k-th numeric values associated with each other if the secret sharing apparatus is the first or second secret sharing apparatus, and a fragment update part that designates (b_(k31) ^((m)), b_(k12) ^((m))) as a fragment b_(k1) ^((m)) if the secret sharing apparatus is the first secret sharing apparatus, designates (b_(k12) ^((m)), b_(k23) ^((m))) as a fragment b_(k2) ^((m)) if the secret sharing apparatus is the second secret sharing apparatus, and designates (b_(k23) ^((m)), b_(k31) ^((m))) as a fragment b_(k3) ^((m)) if the secret sharing apparatus is the third secret sharing apparatus. 8: The secret sharing apparatus according to claim 7, wherein M=1. 9: A secret sharing method, wherein it is assumed that K represents an integer equal to or greater than 2, k represents an integer equal to or greater than 1 and equal to or smaller than K, M represents an integer equal to or greater than 1, m represents an integer equal to or greater than 1 and equal to or smaller than M, A₁ ⁽¹⁾, . . . , A_(K) ⁽¹⁾, . . . , A₁ ^((M)), . . . , and A_(K) ^((M)) are K×M numeric values, a combination (α, β, γ) is any of combinations (1, 2, 3), (2, 3, 1) and (3, 1, 2), three fragments of the numeric value A_(k) ^((m))=a_(kαβ) ^((m))+a_(kβγ) ^((m))+a_(kγα) ^((m)) are (a_(kγα) ^((m)), a_(kαβ) ^((m))), (a_(kαβ) ^((m)), a_(kβγ) ^((m))) and (a_(kβγ) ^((m)), a_(kγα) ^((m))), a group of k-th numeric values associated with each other is formed by A_(k) ⁽¹⁾, . . . , and A_(k) ^((M)), and three secret sharing apparatuses in which said fragments are recorded in a distributed manner are used, and the secret sharing method comprises: a selection step of selecting two secret sharing apparatuses, one of the selected secret sharing apparatuses being designated as a first secret sharing apparatus, the other of the selected secret sharing apparatuses being designated as a second secret sharing apparatus, and the secret sharing apparatus that is not selected being designated as a third secret sharing apparatus; a fragment replacement step of designating a fragment of the numeric value A_(k) ^((m)) recorded in the first secret sharing apparatus as a fragment a_(k1) ^((m))=(a_(k31) ^((m)), a_(k12) ^((m))), designating a fragment of the numeric value A_(k) ^((m)) recorded in the second secret sharing apparatus as a fragment a_(k2) ^((m))=(a_(k12) ^((m)), a_(k23) ^((m))), designating a fragment of the numeric value A_(k) ^((m)) recorded in the third secret sharing apparatus as a fragment a_(k3) ^((m))=(a_(k23) ^((m)), a_(k31) ^((m))), generating a bijection π of {1, . . . , K}→{1, . . . , K} in the first secret sharing apparatus or the second secret sharing apparatus, designating fragments a_(π(k)1) ⁽¹⁾, . . . , and a_(π(k)1) ^((M)) of a group of π(k)-th numeric values associated with each other recorded in the first secret sharing apparatus as fragments of the group of k-th numeric values associated with each other, and designating fragments a_(π(k)2) ⁽¹⁾, . . . , and a_(π(k)2) ^((M)) of a group of π(k)-th numeric values associated with each other recorded in the second secret sharing apparatus as fragments of the group of k-th numeric values associated with each other; a first random number generation step in which the first secret sharing apparatus generates random numbers b_(k31) ⁽¹⁾, . . . , and b_(k31) ^((M)) for reshare of the fragments of the group of k-th numeric values associated with each other and transmits the random numbers b_(k31) ⁽¹⁾, . . . , and b_(k31) ^((M)) to the third secret sharing apparatus; a second random number generation step in which the second secret sharing apparatus generates random numbers b_(k23) ⁽¹⁾, . . . , and b_(k23) ^((M)) for reshare of the fragments of the group of k-th numeric values associated with each other and transmits the random numbers b_(k23) ⁽¹⁾, . . . , and b_(k23) ^((M)) to the third secret sharing apparatus; a first calculation step in which the first secret sharing apparatus calculates a value x_(k) ^((m)) according to x_(k) ^((m))=b_(k31) ^((m))−a_(π(k)31) ^((m)) for m=1 to M for reshare of the fragments of the group of k-th numeric values associated with each other and transmits the values x_(k) ⁽¹⁾, . . . , and x_(k) ^((M)) to the second secret sharing apparatus; a second calculation step in which the second secret sharing apparatus calculates a value y_(k) ^((m)) according to y_(k) ^((m))=b_(k23) ^((m))−a_(π(k)23) ^((m)) for m=1 to M for reshare of the fragments of the group of k-th numeric values associated with each other and transmits the values y_(k) ⁽¹⁾, . . . , and y_(k) ^((M)) to the first secret sharing apparatus; a third calculation step in which the first secret sharing apparatus and the second secret sharing apparatus calculate a value b_(k12) ^((m)) according to b_(k12) ^((m))=a_(π(k)12) ^((m))−x_(k) ^((m))−y_(k) ^((m)) for m=1 to M for reshare of the fragments of the group of k-th numeric values associated with each other; and a fragment update step in which the first secret sharing apparatus designates (b_(k31) ^((m)), b_(k12) ^((m))) as a fragment b_(k1) ^((m)), the second secret sharing apparatus designates (b_(k12) ^((m)), b_(k23) ^((m))) as a fragment b_(k2) ^((m)), and the third secret sharing apparatus designates (b_(k23) ^((m)), b_(k31) ^((m))) as a fragment b_(k3) ^((m)). 10: The secret sharing method according to claim 9, wherein M=1. 11: The secret sharing method according to claim 10, further comprising: an initial information distribution step in which the first secret sharing apparatus generates K random values R⁽¹⁾ ₁, . . . , and R⁽¹⁾ _(K), the second secret sharing apparatus generates K random values R⁽²⁾ ₁, . . . , and R⁽²⁾ _(K), said three secret sharing apparatuses record fragments (r⁽¹⁾ _(k31), r⁽¹⁾ _(k12)), (r⁽¹⁾ _(k12), r⁽¹⁾ _(k23)), and (r⁽¹⁾ _(k23), r⁽¹⁾ _(k31)) of the value R⁽¹⁾ _(k) and fragments (r⁽²⁾ _(k31), r⁽²⁾ _(k12)), (r⁽²⁾ _(k12), r⁽²⁾ _(k23)), and (r⁽²⁾ _(k23), r⁽²⁾ _(k31)) of the value R⁽²⁾ _(k) in a secret sharing manner, and said three secret sharing apparatuses determine fragments (p_(k31), p_(k12)), (p_(k12), p_(k23)), and (p_(k23), p_(k31)) of a numeric value P_(k) that satisfies a relation that P_(k)=R⁽¹⁾ _(k)+R⁽²⁾ _(k) by a secure computation and record the fragments in a distributed manner; an initial multiplication step in which said three secret sharing apparatuses determine fragments (s_(k31), s_(k12)), (s_(k12), s_(k23)), and (s_(k23), s_(k31)) of a value S_(k) that satisfies a relation that S_(k)=P_(k)×A_(k) ⁽¹⁾ by a secure computation and record the fragments (s_(k31), s_(k12)), (s_(k12), s_(k23)), and (s_(k23), s_(k31)) in a distributed manner; a secret sharing update step in which said three secret sharing apparatuses record fragments b_(k1), b_(k2), and b_(k3) obtained by the secret sharing method according to claim as fragments of a numeric value B_(k) ⁽¹⁾; a checking distribution step in which other fragments (r′⁽¹⁾ _(π(k)31), r′⁽¹⁾ _(π(k)12)), (r′⁽¹⁾ _(π(k)12), r′⁽²⁾ _(π(k)23)), and (r′⁽¹⁾ _(π(k)23), r′⁽¹⁾ _(π(k)31)) of said numeric value R⁽¹⁾ _(π(k)) and other fragments (r′⁽²⁾ _(π(k)31), r′⁽²⁾ _(π(k)12)), (r′⁽²⁾ _(π(k)12), r′⁽²⁾ _(π(k)23)), and (r′⁽²⁾ _(π(k)23), r′⁽²⁾ _(π(k)31)) of said numeric value R⁽²⁾ _(π(k)) are recorded in said three secret sharing apparatuses in a distributed manner, said three secret sharing apparatuses determine fragments (q_(k31), q_(k12)), (q_(k12), q_(k23)), and (q_(k23), q_(k31)) of a numeric value Q_(k) that satisfies a relation that Q_(k)=R⁽¹⁾ _(π(k))+R⁽²⁾ _(π(k)) by a secure computation using the other fragments and record the fragments (q_(k31), q_(k12)), (q_(k12), q_(k23)), and (q_(k23), q_(k31)) in a distributed manner; and a checking multiplication step in which said three secret sharing apparatuses determine fragments (t_(k31), t_(k12)), (t_(k12), t_(k23)), and (t_(k23), t_(k31)) of a numeric value T_(k) that satisfies a relation that T_(k)=Q_(k)×B_(k) ⁽¹⁾ by a secure computation and record the fragments (t_(k31), t_(k12)), (t_(k12), t_(k23)), and (t_(k23), t_(k31)) in a distributed manner, wherein fragments recorded in the first secret sharing apparatus are s_(k1)=(s_(k31), s_(k12)) and t_(k1)=(t_(k31), t_(k12)), fragments recorded in the second secret sharing apparatus are s_(k2)=(s_(k12), s_(k23)) and t_(k2)=(t_(k12), t_(k23)), and fragments recorded in the third secret sharing apparatus are s_(k3)=(s_(k23), s_(k31)) and t_(k3)=(t_(k23), t_(k31)), and the secret sharing method further comprises: a third random number generation step in which the first secret sharing apparatus generates a random number u_(k) and transmits the random number u_(k) to the second secret sharing apparatus; a fourth random number generation step in which the second secret sharing apparatus generates a random number v_(k) and transmits the random number v_(k) to the first secret sharing apparatus; a fourth calculation step in which the first secret sharing apparatus calculates a value d_(k) according to d_(k)=s_(π(k)12)−t_(k12)−u_(k)−v_(k) and transmits the value d_(k) to the third secret sharing apparatus; a fifth calculation step in which the second secret sharing apparatus calculates a value e_(k) according to e_(k)=s_(π(k)12)−t_(k12)−u_(k)−v_(k) and transmits the value e_(k) to the third secret sharing apparatus; a first check step in which the third secret sharing apparatus checks whether a relation that d_(k)=e_(k) holds or not and terminates a processing if the relation does not hold; a sixth calculation step in which the first secret sharing apparatus calculates a value f_(k) according to f_(k)=s_(π(k)31)−t_(k31)+u_(k) and transmits the value f_(k) to the third secret sharing apparatus; a seventh calculation step in which the second secret sharing apparatus calculates a value g_(k) according to g_(k)=s_(π(k)23)−t_(k23)+v_(k) and transmits the value g_(k) to the third secret sharing apparatus; and a second check step in which the third secret sharing apparatus checks whether a relation that f_(k)+g_(k)+d_(k)=0 holds or not and terminates a processing if the relation does not hold. 12: The secret sharing method according to claim 9, wherein the fragments b_(k1) ^((m)), b_(k2) ^((m)), and b_(k3) ^((m)) obtained in said fragment update step are regarded as new fragments a_(k1) ^((m)), a_(k2) ^((m)), and a_(k3) ^((m)), and said secret sharing method is repeated until said secret sharing apparatuses are selected in all predetermined combinations in said fragment replacement step. 13: A secret sorting method that uses a secret sharing method according to claim 12, comprising: a comparison step in which three secret sharing apparatuses selects two numeric values from a plurality of numeric values whose fragments are recorded in a distributed manner by the secret sharing method according to claim 12 and compare the two numeric values in terms of magnitude by a secure computation; and an exchange step in which each secret sharing apparatus exchanges fragments of the numeric values based on a result of said comparison step. 14: A non-transitory computer readable medium including computer executable instructions that make a computer function as a secret sharing apparatus in a secret sharing system according to claim
 1. 